Dynamics of rotary drilling with non-uniformly distributed blades
نویسندگان
چکیده
منابع مشابه
Network Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملNon-uniformly Expanding Dynamics in Maps with Singularities and Criticalities
We investigate a one-parameter family of interval maps arising in the study of the geometric Lorenz ow for non-classical parameter values. Our conclusion is that for all parameters in a set of positive Lebesgue measure, the map has a positive Lyapunov exponent. Furthermore, this set of parameters has a density point which plays an important dynamic role. The presence of both singular and critic...
متن کاملAlgebras with Uniformly Distributed Invariants
Let K be a finite abelian extension of the rational field Q. If A is a central simple algebra over K then we let [A] denote the class of A in the Brauer group B(K) of K. The Schur subgrozcp S(K) of B{K) consists of those algebra classes which contain a simple component of the group algebra K[GJ for some finite group G. M. Benard and M. Schacher [2, Theorem 1, p. 3801 have shown that if [A] is i...
متن کاملStoring non-uniformly distributed messages in networks of neural cliques
Associative memories are data structures that allow retrieval of stored messages from part of their content. They thus behave similarly to human brain that is capable for instance of retrieving the end of a song given its beginning. Among different families of associative memories, sparse ones are known to provide the best efficiency (ratio of the number of bits stored to that of bits used). Ne...
متن کاملQuantum Collision-Resistance of Non-uniformly Distributed Functions
We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a distribution with min-entropy k. We prove that Ω(2) quantum queries are necessary to find a collision for function f . This is needed in some security proofs in the quantum random oracle model (e.g. Fujisaki-Okamoto transform).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mechanical Sciences
سال: 2019
ISSN: 0020-7403
DOI: 10.1016/j.ijmecsci.2019.05.016